eXtreme-Ants: Ant Based Algorithm for Task Allocation in Extreme Teams
نویسندگان
چکیده
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating in dynamic environments with possible inter-task constraints. We present an approximate algorithm for task allocation in extreme teams, called eXtreme-Ants. The algorithm is inspired in the division of labor in social insects and in the process of recruitment for cooperative transport observed in ant colonies. The model of division of labor offers fast and efficient decision-making, while the recruitment ensures the allocation of constrained tasks that require simultaneous execution. We show that eXtreme-Ants outperforms other two algorithms regarding communication and computational effort.
منابع مشابه
Ant - Based Task Allocation Among Teams ( Extended
This paper addresses the problem of multiagent task allocation among teams. An approximate algorithm is presented, which is inspired in process of recruitment for cooperative transport observed in ant colonies. It is shown that eXtreme-Ants outperforms other two algorithms regarding communication and computational effort.
متن کاملAllocating Tasks in Extreme Teams
Extreme teams are on the horizon: large-scale agent teams operating in dynamic environments, problematic for current task allocation algorithms due to the lack of locality in agent interactions. We propose a novel distributed task allocation algorithm for extreme teams, called LA-DCOP, that incorporates three key ideas. First, LA-DCOP’s task allocation is based on a dynamically computed minimum...
متن کاملIdle Ants Have a Role
We model and analyze the distributed task allocation problem, which is solved by ant colonies on a daily basis. Ant colonies employ task allocation in which ants are moved from one task to the other in order to meet changing demands introduced by the environment, such as excess or shortage of food, dirtier or cleaner nest, etc. The different tasks are: nursing (overseeing the hatching of newbie...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کامل